Robust FETI solvers for multiscale elliptic PDEs
نویسندگان
چکیده
Finite element tearing and interconnecting (FETI) methods are efficient parallel domain decomposition solvers for large-scale finite element equations. In this work we investigate the robustness of FETI methods in case of highly heterogeneous (multiscale) coefficients. Our main application are magnetic field computations where both large jumps and large variation in the reluctivity coefficient may arise. We give theoretical condition number bounds which are confirmed in numerical tests.
منابع مشابه
Analysis of FETI methods for multiscale PDEs. Part II: interface variation
In this article we give a new rigorous condition number estimate of the finite element tearing and interconnecting (FETI) method and a variant thereof, all-floating FETI. We consider the scalar elliptic equation in a twoor three-dimensional domain with a highly heterogeneous (multiscale) diffusion coefficient. This coefficient is allowed to have large jumps not only across but also along subdom...
متن کاملJOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics Analysis of FETI Methods for Multiscale PDEs - Part II: Interface Variation
In this article we give a new rigorous condition number estimate of the finite element tearing and interconnecting (FETI) method and a variant thereof, all-floating FETI. We consider the scalar elliptic equation in a twoor three-dimensional domain with a highly heterogeneous (multiscale) diffusion coefficient. This coefficient is allowed to have large jumps not only across but also along subdom...
متن کاملAnalysis of FETI methods for multiscale PDEs
In this paper we study a variant of the finite element tearing and interconnecting (FETI) method which is suitable for elliptic PDEs with highly heterogeneous (multiscale) coefficients α(x); in particular, coefficients with strong variation within subdomains and/or jumps that are not aligned with the subdomain interfaces. Using energy minimisation and cut-off arguments we can show rigorously th...
متن کاملSymbolic preconditioning techniques for linear systems of partial differential equations
Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today’s standard applications, it is necessary to rely on iterative Krylov methods that are scalable (i.e., weakly dependent on t...
متن کاملSymbolic Techniques for Domain Decomposition Methods
Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today’s standard applications, it is necessary to rely on iterative Krylov methods that are scalable (i.e., weakly dependent on t...
متن کامل